#include <iostream>
#include <vector>
using namespace std;

int main() {
    int n = 0, m = 0, q = 0;
    while (cin >> n >> m >> q) { // 注意 while 处理多个 case
        vector<vector<int>> arr(n + 1, vector<int>(m + 1, 0));
        vector<vector<long>> dp(n + 1, vector<long>(m + 1, 0));    // 前缀和数组

        for(int i = 1; i < n + 1; i++)
        {
            for(int j = 1; j < m + 1; j++)
            {
                cin >> arr[i][j];
            }
        }

        for(int i = 1; i < n + 1; i++)
        {
            for(int j = 1; j < m + 1; j++)
            {
                dp[i][j] = dp[i - 1][j] + dp[i][j - 1] + arr[i][j]- dp[i - 1][j - 1];  // 处理前缀和数组
            }
        }

        int x1 = 0, y1 = 0, x2 = 0, y2 = 0;
        while(q--)
        {
            cin >> x1 >> y1 >> x2 >> y2;
            cout << dp[x2][y2] - dp[x1 - 1][y2] - dp[x2][y1 - 1] + dp[x1 - 1][y1 - 1] << endl;
        }
    }

    return 0;
}
// 64 位输出请用 printf("%lld")